Representations of Matroids in Semimodular Lattices
نویسندگان
چکیده
We prove equivalence of two definitions of representability of matroids: representation by vector configurations and representation by retraction of buildings of type An. Proofs are given in a more general context of representation of matroids in semimodular lattices and Coxeter matroids in chamber systems with group metric.
منابع مشابه
Frankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملOn the relationship between the notions of independence in matroids, lattices, and Boolean algebras
We discuss the relationship between the notion of independence as defined in lattice theory, matroid theory, and Boolean algebras. Collections of Boolean sub-algebras {At} are indeed endowed with the following independence relation (IB) ∩At 6= ∧ with ∧ the initial element of the Boolean algebra they belong to. However, those collections can be given several algebraic interpretations in terms of...
متن کاملClosed-set lattice of regular sets based on a serial and transitive relation through matroids
Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a serial and transitive relation on a universe, the collection of all the regular sets of the generalized rough set is a lattice. In this paper, we use the latt...
متن کاملThe notion of independence in the theory of evidence: An algebraic study
In this paper we discuss the nature of independence of sources in the theory of evidence from an algebraic point of view, starting from an analogy with projective geometries. Independence in Dempster’s rule is equivalent to independence of frames as Boolean algebras. Collection of frames, in turn, can be given several algebraic interpretations in terms of semimodular lattices, matroids, and geo...
متن کاملSlim Semimodular Lattices. I. A Visual Approach
A finite lattice L is called slim if no three join-irreducible elements of L form an antichain. Slim lattices are planar. Slim semimodular lattices play the main role in [3], where lattice theory is applied to a purely group theoretical problem. After exploring some easy properties of slim lattices and slim semimodular lattices, we give two visual structure theorems for slim semimodular lattices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 22 شماره
صفحات -
تاریخ انتشار 2001